Application Of Imperialist Competitive Algorithm To The Emergency Medical Services Location Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imperialist Competitive Algorithm to the Emergency Medical Services Location Problem

Minimization of arrival time at scenes plays an essential role to help injured people in emergency events. This can be undertaken through mathematical programming models, called emergency medical services location problem, and solved by conventional exact algorithms or by recent meta-heuristic methods as well. Meta-heuristic algorithms have recently been realized to be more efficient in the sen...

متن کامل

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...

متن کامل

Efficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes

An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...

متن کامل

The Application of Imperialist Competitive Algorithm for Fuzzy Random Portfolio Selection Problem

This paper presents an implementation of the Imperialist Competitive Algorithm (ICA) for solving the fuzzy random portfolio selection problem where the asset returns are represented by fuzzy random variables. Portfolio Optimization is an important research field in modern finance. By using the necessity-based model, fuzzy random variables reformulate to the linear programming and ICA will be de...

متن کامل

Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem

The im perialist competitive algorithm (ICA) is a new h euristic algorithm proposed for continuous optim ization problems. The research about its application on solving the traveling salesm an problem (TSP) is still very lim ited. Aiming to explore its ability on solving TSP, we present a discrete im perialist competitive algorithm in this paper. The proposed algorithm modifies the original rul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Artificial Intelligence & Applications

سال: 2011

ISSN: 0976-2191

DOI: 10.5121/ijaia.2011.2411